Logic of Non-monotonic Interactive Proofs

نویسنده

  • Simon Kramer
چکیده

We propose a monotonic logic of internalised non-monotonic or instant interactive proofs (LiiP) and reconstruct an existing monotonic logic of internalised monotonic or persistent interactive proofs (LiP) as a minimal conservative extension of LiiP. Instant interactive proofs effect a fragile epistemic impact in their intended communities of peer reviewers that consists in the impermanent induction of the knowledge of their proof goal by means of the knowledge of the proof with the interpreting reviewer: If my peer reviewer knew my proof then she would at least then (in that instant) know that its proof goal is true. Their impact is fragile and their induction of knowledge impermanent in the sense of being the case possibly only at the instant of learning the proof. This accounts for the important possibility of internalising proofs of statements whose truth value can vary, which, as opposed to invariant statements, cannot have persistent proofs. So instant interactive proofs effect a temporary transfer of certain propositional knowledge (knowable ephemeral facts) via the transmission of certain individual knowledge (knowable non-monotonic proofs) in distributed systems of multiple interacting agents.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic of Negation-Complete Interactive Proofs (Formal Theory of Epistemic Deciders)

We produce a decidable classical normal modal logic of internalised negation-complete or disjunctive non-monotonic interactive proofs (LDiiP) from an existing logical counterpart of non-monotonic or instant interactive proofs (LiiP). LDiiP internalises agent-centric proof theories that are negation-complete (maximal) and consistent (and hence strictly weaker than, for example, Peano Arithmetic)...

متن کامل

Non-monotonic set theory as a pragmatic foundation of mathematics∗

In this paper I propose a new approach to the foundation of mathematics: non-monotonic set theory. I present two completely different methods to develop set theories based on adaptive logics. For both theories there is a finitistic non-triviality proof and both theories contain (a subtle version of) the comprehension axiom schema. The first theory contains only a maximal selection of instances ...

متن کامل

A Logic of Interactive Proofs (Formal Theory of Knowledge Transfer)

We propose a logic of interactive proofs as a framework for an intuitionistic foundation for interactive computation, which we construct via an interactive analog of the Gödel-McKinsey-Tarski-Artëmov definition of Intuitionistic Logic as embedded into a classical modal logic of proofs, and of the Curry-Howard isomorphism between intuitionistic proofs and typed programs. Our interactive proofs e...

متن کامل

Semi-analytic Tableaux For Propositional Modal Logics of Nonmonotonicity

The propositional monotonic modal logics K45, K45D, S4:2, S4R and S4F elegantly capture the semantics of many current nonmonotonic formalisms as long as (strong) de-ducibility of A from a theory ?; ? ` A; allows the use of necessitation on the members of ?: This is usually forbidden in modal logic where ? is required to be empty, resulting in a weaker notion of deducibility. Recently, Marek, Sc...

متن کامل

Visualization of Proofs in Defeasible Logic

The development of the Semantic Web proceeds in steps, building each layer on top of the other. Currently, the focus of research efforts is concentrated on logic and proofs, both of which are essential, since they will allow systems to infer new knowledge by applying principles on the existing data and explain their actions. Research is shifting towards the study of non-monotonic systems that a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013